On sequential composition, action prefixes and process prefix

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining Sequential Rules Based on Prefix-Tree

We consider the problem of discovering sequential rules between frequent sequences in sequence databases. A sequential rule expresses a relationship of two event series happening one after another. As well as sequential pattern mining, sequential rule mining has broad applications such as the analyses of customer purchases, web log, DNA sequences, and so on. In this paper, for mining sequential...

متن کامل

Weak Sequential Composition in Process Algebras

In this paper we study a special operator for sequential compo sition which is de ned relative to a dependency relation over the actions of a given system The idea is that actions which are not dependent intuitively because they share no common resources do not have to wait for one another to proceed even if they are composed sequentially Such a notion has been studied before in a linear time s...

متن کامل

A Deontic Action Logic with Sequential Composition of Actions

We start our investigations from the deontic action model defined in multi-situation settings. Then we discuss the validity of formulas constructed in a language with a finite number of basic actions, parallel and sequential compositions of actions, a free choice operator and the standard deontic operators of obligation, strong permission and prohibition. The main achievements of the paper are ...

متن کامل

On Composition and Implementation of Sequential Consistency

To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations. Waiting only for one of them suffices for sequential consistency. This paper extends this result to crash-prone asynchronous systems, proposing a distributed algorithm building a sequential...

متن کامل

Action-timing problem with sequential Bayesian belief revision process

We consider the problem of deciding the best action time when observations are made sequentially. Specifically we address a special type of optimal stopping problem where observations are made from state-contingent distributions and there exists uncertainty on the state. In this paper, the decision-maker's belief on state is revised sequentially based on the previous observations. By using the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formal Aspects of Computing

سال: 1994

ISSN: 0934-5043,1433-299X

DOI: 10.1007/bf01215407